Structured connectionist systems

A Structured Connectionist Unification Algorithm

A connectionist unification algorithm is presented. It utilizes the fact that the most general unifier of two terms corresponds to a finest valid equivalence relation defined on a occurrence-label representation of the unification problem. The algorithm exploits the maximal parallelism inherent in the computation of such a finest valid equivalence relation while using only computational feature...

Parsing Complex Sentences with Structured Connectionist Networks

A modular, recurrent connectionist network is taught to incrementally parse complex sentences. From input presented one word at a time, the network learns to do semantic role assignment, noun phrase attachment, and clause structure recognition, for sentences with both active and passive constructions and center-embedded clauses. The network makes syntactic and semantic predictions at every step...

Towards Instructable Connectionist Systems

Dissociation in connectionist systems.

Connectionist techniques are increasingly being used to model cognitive function with a view to providing extensions, elaborations or replacements of earlier “box and arrow” models. Networks of simplified processing units loosely based on real neurons are set up with architectures based on known physiology, trained to perform appropriately simplified versions of real tasks, and iteratively refi...

Connectionist Inference Systems

This paper presents a survey of connectionist inference systems. 1 Motivation In almost all situations of our life we make decisions based on huge amounts of knowledge, which is often vage, incomplete, or even inconsistent. We have gathered the knowledge as well as the decision procedures in a long process of education and experience. In fact, the learning process never stops throughout our lif...